Network Multiplexer with Generalized Processor Sharing and Heavy-tailed On-Off Flows
نویسندگان
چکیده
We consider a set of fluid On-Off flows that share a common server of capacity c and a finite buffer B. The server capacity is divided using Generalized Processor Sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long term average demand ρi. The buffer sharing is unrestricted as long as there is available space; if the buffer is full, the necessary amount of fluid from the most demanding flows is discarded. When the On periods are heavy-tailed, we show that the loss rate of a particular flow i is asymptotically equal to the loss rate in a reduced system with capacity c − Σj 6=iρj and buffer B, where this flow is served in isolation. In particular, each flow perceives to have the whole buffer B to itself. This insight provides a new guideline for efficiently engineering differentiated quality of service in integrated multimedia networks.
منابع مشابه
Finite buffer queue with generalized processor sharing and heavy-tailed input processes
We consider a set of N fluid On–Off flows that share a common server of capacity c and a finite buffer B. The server capacity is allocated using the generalized processor sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long-term average demand qi. The buffer sharing is unrestricted as long as there is available space. If the buffer is full, the nec...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملGeneralized Processor Sharing Queues with Heterogeneous Traffic Classes
We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behavior...
متن کاملNetwork Multiplexer with Truncated Heavy-Tailed Arrival Streams
This pa.per investigates the asymptotic behavior of a single server queue with truncated heavy-tailed arrival sequences. 14'-e have discovered and explicitly asymptotically cha.ra.cterized a unique asymptotic behavior of t,he queue length distribution. Informally, this distribution on t,he log scale resembles a stair-wave function t h t lias steep drops a t specific buffer sizes. This has impor...
متن کاملCentrum Voor Wiskunde En Informatica Induced Burstiness in Generalized Processor Sharing Queues with Long-tailed Traffic Flows Induced Burstiness in Generalized Processor Sharing Queues with Long-tailed Traac Flows
We analyze the queueing behavior of long-tailed traac ows under the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing, play a major role in achieving diierentiated quality-of-service in integrated-services networks. We prove that, in certain scenarios, a ow may be strongly aaected by the activity of`heavier'-tailed ows, and may inher...
متن کامل